Tuning the clustering coefficient of generalized circulant networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Social triangles and generalized clustering coefficient for weighted networks

In the context of expert systems approach, the problem of community detection can be afford as a clustering model for networks. In this respect, a way to measure the community structure is the clustering coefficient. Such a quantity is based on the number of existing triangles around the nodes over the theoretical ones. To the best of our knowledge, scarce attention has been paid to the fictiti...

متن کامل

Generalizations of the clustering coefficient to weighted complex networks.

The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize existing ones to take the weights of links into account. Here we focus on various generalizations of the clustering coefficient, which is one of the central characteristics in the complex network theory. We present a comparative study of the several suggestions introduce...

متن کامل

The clustering coefficient and community structure of bipartite networks

Many real-world networks display a natural bipartite structure. It is necessary and important to study the bipartite networks by using the bipartite structure of the data. Here we propose a modification of the clustering coefficient given by the fraction of cycles with size four in bipartite networks. Then we compare the two definitions in a special graph, and the results show that the modifica...

متن کامل

Separation Number and Generalized Clustering Coefficient in Small World Networks based on String Formalism

We reformulated the string formalism given by Aoyama, using an adjacent matrix of a network and introduced a series of generalized clustering coefficients based on it. Furthermore we numerically evaluated Milgram condition proposed by their article in order to explore q-th degrees of separation in scale free networks. In this article, we apply the reformulation to small world networks and numer...

متن کامل

Lightweight MDS Generalized Circulant Matrices

In this article, we analyze the circulant structure of generalized circulant matrices to reduce the search space for finding lightweight MDS matrices. We first show that the implementation of circulant matrices can be serialized and can achieve similar area requirement and clock cycle performance as a serial-based implementation. By proving many new properties and equivalence classes for circul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physica A: Statistical Mechanics and its Applications

سال: 2021

ISSN: 0378-4371

DOI: 10.1016/j.physa.2021.126088